Welcome![Sign In][Sign Up]
Location:
Search - open shortest path first

Search list

[TCP/IP stacksrcspf

Description: 开放最短路径优先,网络协议编程,-Open Shortest Path First, the network protocol programming,
Platform: | Size: 192783 | Author: 汤剑 | Hits:

[Other resourceCCNA_noteboot

Description: 第一章:Internetworking 第二章:Internet Protocols 第三章:IP Subnetting and Variable Length Subnet Masks(VLSM) 第四章:Introduction to the Cisco IOS 第五章:IP路由 第六章:Enhanced IGRP(EIGRP) and Open Shortest Path First(OSPF) 第七章:Layer 2 Switching 第八章:Virtual LANs(VLANs) 第九章:Managing a Cisco Interwork 第十章:Managing Traffic with Access Lists 第十一章:Wide Area Networking Protocols
Platform: | Size: 2190121 | Author: 林长虹 | Hits:

[Internet-Network15

Description: OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表,以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。 开放最短路径优先协议(Open Shortest Path First,OSPF)是目前最主要的内部网关协议之一。通过本课程设计,学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。
Platform: | Size: 1084 | Author: 猪八戒 | Hits:

[TCP/IP stacksrcspf

Description: 开放最短路径优先,网络协议编程,-Open Shortest Path First, the network protocol programming,
Platform: | Size: 192512 | Author: 汤剑 | Hits:

[OtherCCNA_noteboot

Description: 第一章:Internetworking 第二章:Internet Protocols 第三章:IP Subnetting and Variable Length Subnet Masks(VLSM) 第四章:Introduction to the Cisco IOS 第五章:IP路由 第六章:Enhanced IGRP(EIGRP) and Open Shortest Path First(OSPF) 第七章:Layer 2 Switching 第八章:Virtual LANs(VLANs) 第九章:Managing a Cisco Interwork 第十章:Managing Traffic with Access Lists 第十一章:Wide Area Networking Protocols-Chapter I: Internetworking Chapter II: Internet Protocols Chapter III: IP Subnetting and Variable Length Subnet Masks (VLSM) Chapter IV: Introduction to the Cisco IOS Chapter V: IP Routing Chapter VI: Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF) Chapter VII: Layer 2 Switching Chapter VIII: Virtual LANs (VLANs) Chapter IX: Managing a Cisco Interwork Chapter X: Managing Traffic with Access Lists Chapter XI: Wide Area Networking Protocols
Platform: | Size: 2190336 | Author: 林长虹 | Hits:

[Internet-Network15

Description: OSPF是一种路由选择协议。路由选择算法和路由选择协议在概念上是不同的。网络上的主机、路由器通过路由选择算法形成路由表,以确定发送分组的传输路径。而路由选择协议是路由器用来建立路由表和更新路由信息的通信协议。 开放最短路径优先协议(Open Shortest Path First,OSPF)是目前最主要的内部网关协议之一。通过本课程设计,学生可以对路由表的建立和路由信息的更新等有更直观和清晰的认识。 -OSPF is a routing protocol. Routing algorithm and routing protocol in the concept is different. Network hosts, routers, routing algorithm, through the formation of routing table to determine the sending packet transmission path. The routing protocol is a router used to create routing tables and update the routing information of the communication protocol. Open Shortest Path First protocol (Open Shortest Path First, OSPF) is the most important one of the internal gateway protocol. Through the curriculum design, students can establish a routing table and routing information updates such as more intuitive and clear understanding.
Platform: | Size: 1024 | Author: 猪八戒 | Hits:

[Internet-NetworkOSPF

Description: OSPF- Open shortest path first. which a routing protocol. uses IP version 4-OSPF- Open shortest path first. which a routing protocol. uses IP version 4
Platform: | Size: 8192 | Author: Muni | Hits:

[OtherSHORTEST

Description: 开放式最短路径优先,基本的OSPF配置,给O S P F配置接口参数-Open Shortest Path First, OSPF basic configuration, the OSPF interface configuration parameters
Platform: | Size: 2646016 | Author: 余婷 | Hits:

[Internet-Networkcrfc2328_chinese

Description: 本备忘录说明了OSPF协议版本2。OSPF是一种连接状态/link-state路由协议,被设计用于单一的自制系统/Autonomous System中。每个OSPF路由器都维持着同样的数据库以描述AS的拓扑结构,并以此数据库来创建最短路径树并计算路由表。-Open Shortest Path First(OSPF)TCP/IP
Platform: | Size: 122880 | Author: maying | Hits:

[OtherCcnaNote

Description: CCNA菜鸟笔记 2006版 包含以下内容: 第一章 网际互联 第二章 因特网协议 第三章 IP 子网划分和变长子网掩码(VLSM) 第四章 Cisco IOS 简介 第五章 IP 路由 第六章 增强 IGRP(EIGRP)和开放最短路径优先(OSPF) 第七章 虚拟局域网(VLAN) 第八章 管理 Cisco 互联网络 第九章 局域网类故障 第十章 使用访问列表管理流量 第十一章 广域网协议 -Rookie CCNA Notes, 2006 Edition contains the following contents: Chapter I Chapter II internetworking Chapter III of Internet Protocol IP subnetting and variable length subnet mask (VLSM) About Cisco IOS Chapter IV Chapter V Chapter VI IP Routing Enhanced IGRP (EIGRP) and Open Shortest Path First (OSPF) Chapter VII of the virtual LAN (VLAN) of Chapter VIII of the management of Cisco LAN Internet Chapter IX Chapter X-type fault management using the access list WAN traffic agreement Chapter XI
Platform: | Size: 2438144 | Author: 申亚囡 | Hits:

[Data structsWeb_Design_Guide_Open_Shortest_Path_First

Description: 网络设计开放式最短路径优先教程Web Design Guide Open Shortest Path First -Web Design Open Shortest Path First Tutorial Web Design Guide Open Shortest Path First
Platform: | Size: 670720 | Author: ask | Hits:

[Internet-NetworkRIP--EIGRP--and-OSPF-using-OPNET

Description: 本文章用OPNET作为工具,建设不同的模拟场景和参数,分析RIP,EIGRP和OSPF这三种路由协议的优缺点。-Performance Analysis of RIP, EIGRP, and OSPF using OPNET.Routing protocols are key elements of modern communication networks. Currently deployed dynamic routing protocols that are used to propagate network topology information to the neighboring routers are Routing Information Protocol (RIP), Enhanced Interior Gateway Routing Protocol (EIGRP), and the Open Shortest Path First (OSPF) protocol. The choice of the right routing protocol depends on a number of parameters. In this paper, we use OPNET Modeler to analyze the performance of RIP, EIGRP, and the OSPF protocols, which are commonly deployed in Internet Protocol (IP) networks. We designed various simulation scenarios to compare their performance.
Platform: | Size: 326656 | Author: fafan | Hits:

[matlabdijikstra

Description: For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).-For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
Platform: | Size: 1024 | Author: yashika | Hits:

[Windows DevelopOSPF

Description: open source shortest path first protocol
Platform: | Size: 6144 | Author: ramesh | Hits:

[Other1--OPEN-SHORTEST-PATH-FIRST(OSPF)

Description: Biggest advantage of OSPF over EIGRP is that it will run on any device as its based on open standard
Platform: | Size: 17408 | Author: osama | Hits:

[OtherOSPF-Routing-Protocol

Description: In this article w ill learn about the OSPF Routing Protocol Open-Shortest-Path-First (OSPF) is the most widely used interior gateway protocol routing protocol on the world because it is a public (non-proprietary) routing protocol while its biggest rival, EIGRP, is a Cisco proprietary protocol so other vendors can’t use it. OSPF is a complex link-state routing protocol. Link-state routing protocols generate routing updates only when a change occurs in the network topology. When a link changes state, the device that detected the change creates a link-state advertisement (LSA) concerning that link and sends to all neighboring devices using a special multicast address. Each routing device takes a copy of the LSA, updates its link-state database (LSDB), and forwards the LSA to all neighboring devices -In this article we will learn about the OSPF Routing Protocol Open-Shortest-Path-First (OSPF) is the most widely used interior gateway protocol routing protocol on the world because it is a public (non-proprietary) routing protocol while its biggest rival, EIGRP, is a Cisco proprietary protocol so other vendors can’t use it. OSPF is a complex link-state routing protocol. Link-state routing protocols generate routing updates only when a change occurs in the network topology. When a link changes state, the device that detected the change creates a link-state advertisement (LSA) concerning that link and sends to all neighboring devices using a special multicast address. Each routing device takes a copy of the LSA, updates its link-state database (LSDB), and forwards the LSA to all neighboring devices
Platform: | Size: 269312 | Author: osama | Hits:

CodeBus www.codebus.net